Explicit fusions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Fusions

We introduce explicit fusions of names. An explicit fusion is a process that exists concurrently with the rest of the system and enables two names to be used interchangeably. Explicit fusions provide a small-step account of reaction in process calculi such as the pi calculus and the fusion calculus. In this respect they are similar to the explicit substitutions of Abadi, Cardelli and Curien, wh...

متن کامل

Explicit Fusions: Theory and Implementation

This work describes a concurrent, distributed abstract machine for the pi calculus. Its primary audience are researchers in the field of concurrency. The secondary audience are working programmers looking for a better way to write interactive programs. This audience need only read Chapters 1 (an overview) and 5 (the implementation). I hope that these chapters might prove appealing to students w...

متن کامل

A Category of Explicit Fusions

Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the π-calculus, are presheaf categorie...

متن کامل

Transformed fusions

or most normal mammalian cells, survival depends on attachment. By binding to integrins, many extracellular matrix proteins activate survival pathways that prevent detachment-induced apoptosis. But on page 559 Todorovic et al. reveal a matrix molecule that kills instead. This death matrix protein, CCN1, is selective in its carnage. Endothelial cells are known to thrive on CCN1, but the group no...

متن کامل

Fusions of Description

1 Motivation and outline In order to ensure a reasonable and predictable behaviour of a Description Logic (DL) system, reasoning in the DL employed by the system should at least be decidable, and preferably of low complexity. Consequently, the expressive power of the DL in question must be restricted in an appropriate way. If the imposed restrictions are too severe, however, then the important ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2005

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.03.017